Partitioned-ROBDDs: A Compact, Canonical and Efficiently Manipulatible Representation for Boolean Functions Ken McMillan A Conjunctively Decomposed Representation for Boolean Functions

The fourth workshop Decision Diagrams – Concepts and Applications in the series Computer Aided Design and Test at the IBFI SchloßDagstuhl was organized by Bernd Becker (Univ. Freiburg), Randy Bryant (Carnegie Mellon Univ.), Masahiro Fujita (Fujitsu Labs. San José) and Christoph Meinel (Univ. Trier). It was attended by 39 scientists. Binary Decision Diagrams (BDDs) have found widespread use in computer-aided design for digital circuits. They form the heart of many tools for formal verification and are also commonly used in logic synthesis, circuit testing and in the verification of communication protocols. The organizers took the opportunity to bring together researchers from different areas in computer science, electrical engineering and industry. The common aim of all researchers is to deepen the knowledge of the – widely accepted – BDD data structures, to improve existing techniques and to explore new fields of application. Twenty-eight lectures were presented at the workshop covering the following theoretical and practical topics: